Optimizing Multi-Site Production Planning and Scheduling with a Hybrid Genetic Algorithm

نویسندگان

  • Chyuan Perng
  • Ping-Teng Chang
  • Shui-Shun Lin
  • Chun-Chia Huang
چکیده

As the economic environment continues to change rapidly, so does the demand placed on industries to meet ever expanding orders. In order to meet this demand, the need to expand is matched by the need to utilize existing facilities, and increase efficiency. As a result, conventional order management programs often no longer suffice. Single-site planning has developed into multi-site planning, leading to distance problems between sites as well as problems regarding information transfers between them. This study aims at constructing a decision model of an integrated multi-site production scheduling problem. To support multi-site factories with their mass orders, based on the premise that they were under total order management systems, the decision model considered such complicated factors as the product market features, due date, production scheduling, and order profit and capacity of each site. Most real-world scheduling problems involve multiple objectives which may be conflicting with each other. In addition, the effect factors taken into account by previous multi-objective scheduling research are essentially quantitative factors. However, more qualitative factors also have to be considered related to organizations’ operating messages. We propose an integrated production scheduling model and use hybrid genetic algorithm methods as solution procedures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi-objective genetic algorithm (MOGA) for hybrid flow shop scheduling problem with assembly operation

Scheduling for a two-stage production system is one of the most common problems in production management. In this production system, a number of products are produced and each product is assembled from a set of parts. The parts are produced in the first stage that is a fabrication stage and then they are assembled in the second stage that usually is an assembly stage. In this article, the first...

متن کامل

A novel mathematical model for a hybrid flow shop scheduling problem under buffer and resource limitations-A case study

Scheduling problems play a big role in manufacturing and planning the production for increasing the production efficiency and assigning the resources to operations. Furthermore, in many manufacturing systems there is a physical space between stages that called intermediate buffers. In this study, a model is proposed for minimizing the makespan of a hybrid flow shop scheduling problem with inter...

متن کامل

Multi-site production planning in hybrid make-to-stock/make-to-order production environment

Today competitive environment has enforced practitioners and researchers to pay great attention to issues enhancing both production and marketing competitiveness. To do so, it has been obligatory for the firms to consider production side activities while customer requirements are on the other side of competition. In this regard, hybrid make-to-stock (MTS)/make-to-order (MTO) production systems ...

متن کامل

A New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

متن کامل

Solving Flexible Job Shop Scheduling with Multi Objective Approach

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008